Trajectory Optimization of Contact-Rich Motions Using Implicit Differential Dynamic Programming
نویسندگان
چکیده
This work presents a Differential Dynamic Programming (DDP) approach for systems characterized by implicit dynamics using sensitivity analysis, such as those modelled via inverse dynamics, variational, and integrators. It leads to more general formulation of DDP, enabling the use faster recursive Newton-Euler dynamics. We leverage precise exact contact modelling in where we focus on two contributions: (1) at acceleration level; (2) an invertible model forward pass closed-form solution backward improve numerical resolution contacts. The performance proposed framework is validated comparing versus explicit DDP swing-up double pendulum, planning motions tasks single leg making multi-body contacts with environment: standing up from ground, priori enumeration challenging, maintaining balance under external perturbation.
منابع مشابه
Variational Contact-Implicit Trajectory Optimization
We present a formulation of rigid body dynamics with frictional contact that leverages ideas from discrete mechanics to derive time-stepping schemes with any desired order of integration accuracy. By utilizing the new time-stepping methods as dynamics constraints in a direct trajectory optimization scheme, we are able to perform contact-implicit trajectory optimization with accuracy equal to tr...
متن کاملTrajectory Optimization for a Multistage Launch Vehicle Using Nonlinear Programming
This work is an example of application of nonlinear programming to a problem of three-dimensional trajectory optimization for multistage launch vehicles for geostationary orbit missions. The main objective is to minimize fuel consumption or equivalently to maximize the payload. The launch vehicle considered here, Europa-II, consists of 5 thrust phases and 2 coast phases. Major parameters of the...
متن کاملTrajectory Segmentation Using Dynamic Programming
We consider the segmentation of a trajectory into piecewise polynomial parts, or possibly other forms. Segmentation is typically formulated as an optimization problem which trades off model fitting error versus the cost of introducing new segments. Heuristics such as split-and-merge are used to find the best segmentation. We show that for ordered data (eg., single curves or trajectories) the gl...
متن کاملTrajectory Optimization using Mixed-Integer Linear Programming
This thesis presents methods for finding optimal trajectories for vehicles subjected to avoidance and assignment requirements. The former include avoidance of collisions with obstacles or other vehicles and avoidance of thruster plumes from spacecraft. Assignment refers to the inclusion of decisions about terminal constraints in the optimization, such as assignment of waypoints to UAVs and the ...
متن کاملTrajectory-Based Dynamic Programming
This paper reviews a variety of ways to use trajectory optimization to accelerate dynamic programming. Dynamic programming provides a way to design globally optimal control laws for nonlinear systems. However, the curse of dimensionality, the exponential dependence of space and computation resources needed on the dimensionality of the state and control, limits the application of dynamic program...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE robotics and automation letters
سال: 2021
ISSN: ['2377-3766']
DOI: https://doi.org/10.1109/lra.2021.3061341